Control Complexity of Schulze Voting
نویسندگان
چکیده
Schulze voting is a recently introduced voting system enjoying unusual popularity and a high degree of real-world use, with users including the Wikimedia foundation, several branches of the Pirate Party, and MTV. It is a Condorcet voting system that determines the winners of an election using information about paths in a graph representation of the election. We resolve the complexity of many electoral control cases for Schulze voting. We find that it falls short of the best known voting systems in terms of control resistance, demonstrating vulnerabilities of concern to some prospective users of the system.
منابع مشابه
Manipulation and Control Complexity of Schulze Voting
Schulze voting is a recently introduced voting system enjoying unusual popularity and a high degree of real-world use, with users including the Wikimedia foundation, several branches of the Pirate Party, and MTV. It is a Condorcet voting system that determines the winners of an election using information about paths in a graph representation of the election. We resolve the complexity of many el...
متن کاملSchulze and Ranked - Pairs Voting Are Fixed - Parameter
Schulze and ranked-pairs elections have received attention recently, with the former having quickly become a widely used election system. For many cases these systems have been proven resistant to bribery, control, and manipulation, with ranked pairs being particularly praised for being NPhard for all three of those. Nonetheless, this work shows that with respect to the number of candidates, bo...
متن کاملFrom Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
In this thesis we study computational aspects of different voting problems and cooperative games with hedonic preferences. For two well-studied voting systems, namely Bucklin and fallback voting, we present a detailed study of the computational complexity of common manipulative attacks on elections. We fully describe the classical worst-case complexity of manipulation, bribery, and swap bribery...
متن کاملControl Complexity in Fallback Voting
We study the control complexity of fallback voting. Like manipulation and bribery, electoral control describes ways of changing the outcome of an election; unlike manipulation or bribery attempts, control actions—such as adding/deleting/partitioning either candidates or voters— modify the participative structure of an election. Via such actions one can try to either make a favorite candidate wi...
متن کاملExploring Voting Anomalies Using a Demand Revealing Random Price Voting Mechanism
Recent papers show that in group decisions individuals have social preferences for efficiency and equity. However, the effect of social preferences on voting, the predominant funding mechanism for public goods, has not been thoroughly examined. This study investigates whether voting decisions are affected by the distribution of net benefits associated with a proposed public program using a new ...
متن کامل